Remarks about the unification type of several non-symmetric non-transitive modal logics

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal and Non Modal Qualitative Spatial Logics

In this paper we review previous work on non modal spatial logics and explore a corresponding modal spatial logic. Furthermore we present an initial classication of kinds of spatially indexed propositions.

متن کامل

Decidability of Pseudo-Transitive Modal Logics

We call a modal logic “pseudo-transitive” if it obeys the axiom A ⊃ A. The question whether the modal logic K extended with this axiom is decidable, is a known open problem. In this paper, I will present a cut-free deductive system which is sound and complete for that logic, and which is suitable for proof search. In fact, the system induces a terminating proof search procedure, which entails d...

متن کامل

Labelled Tableaux for Non-normal Modal Logics

In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.

متن کامل

Non-finitely axiomatisable two-dimensional modal logics

We show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many pr...

متن کامل

A study on transitive modal logics

The concern of this paper is the study of automated deduction methods for propositional modal logics. We use tableau proof-systems to show that Fitting's translation of the transitive modal logic S4 into T can be constructed in deterministic polynomial time. Moreover, we establish a polynomial bound to the length of branches in both tableau and sequent proof search for the transitive logics S4 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logic Journal of the IGPL

سال: 2018

ISSN: 1367-0751,1368-9894

DOI: 10.1093/jigpal/jzy078